Planning motion in environments with similar obstacles
نویسندگان
چکیده
In this work, we investigate solutions to the following question: Given two motion planning problems W1 and W2 with the same robot and similar obstacles, can we reuse the computation from W1 to solve W2 more efficiently? While the answer to this question can find many practical applications, all current motion planners ignore the correspondences between similar environments. Our study shows that by carefully storing and reusing the computation we can gain significant efficiency.
منابع مشابه
Planning Robot Motion in a 2-D Region with Unknown Obstacles
The purpose of this paper is to present several algorithms for planning the motion of a robot in a two-dimensional region having obstacles whose shapes and locations are unknown. The convergence and efficiency of the algorithms are discussed and upper bounds for the lengths of paths generated by the different algorithms are derived and compared.
متن کاملFast and Bounded Probabilistic Collision Detection in Dynamic Environments for High-DOF Trajectory Planning
We present a novel approach to perform probabilistic collision detection between a high-DOF robot and high-DOF obstacles in dynamic, uncertain environments. In dynamic environments with a highDOF robot and moving obstacles, our approach efficiently computes accurate collision probability between the robot and obstacles with upper error bounds. Furthermore, we describe a prediction algorithm for...
متن کاملMotion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motion planning problem in environments with a low obstacle density. Such environments frequently occur in practical instances of the motion planning problem. The complexity of the free space for such environments is known to be linear in the number of obstacles. Our paradigm is a new cell decomposition approach to...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملReal-time Sensor-based Obstacle Modeling in Configuration Space for Manipulator Motion Planning
This paper presents an approach to sensor-based obstacle modeling in a configuration space for manipulator motion planning in unknown environments. In order to achieve this objective, an efficient algorithm is used to fast map obstacles based on defined fundamental obstacles in the workspace and their images in the configuration space. A manipulator is assumed to be equipped with “distance” sen...
متن کامل